Extensions of Magic Square Using Recovery Nodes Against Node Failures
نویسندگان
چکیده
Magic Square is a ppeer-to-peer protocol for searching resources. The recovery cost of Magic Square is high and the system doesn’t recover the failure in simultaneous neighbor nodes’ failure. This paper uses a recovery node for handling all kind of node failure. The recovery node stores a chunk's routing information of the entire nodes and has links to neighbor recovery nodes. Our scheme is simple and enables to recover links between nodes quickly. Results from simulations show that the system performance doesn’t decrease and recovery nodes recover all links and resources in Magic Square.
منابع مشابه
Dynamic Data Replication for Tolerating Single Node Failures in Shared Virtual Memory Clusters of Workstations
In this paper we investigate how shared memory clusters can take advantage of replication to tolerate single system failures. We start from a shared virtual memory protocol (GeNIMA) that has been optimized for low-latency, highbandwidth system area networks. We propose a set of extensions that maintain shared data consistent in the presence of failures and support SMP nodes. Our scheme uses dyn...
متن کاملEncoding of Network Protection Codes Against Link and Node Failures Over Finite Fields
Link and node failures are common two fundamental problems that affect operational networks. Hence, protection of communication networks is essential to increase their reliability, performance, and operations. Much research work has been done to protect against link and node failures, and to provide reliable solutions based on pre-defined provision or dynamic restoration of the domain. In this ...
متن کاملSecuring AODV routing protocol against the black hole attack using Firefly algorithm
Mobile ad hoc networks are networks composed of wireless devices to create a network with the ability for self-organization. These networks are designed as a new generation of computer networks to satisfy some specific requirements and with features different from wired networks. These networks have no fixed communication infrastructure and for communication with other nodes the intermediate no...
متن کاملA Non-MDS Erasure Code Scheme for Storage Applications
This paper investigates the use of redundancy and self repairing against node failures indistributed storage systems using a novel non-MDS erasure code. In replication method, accessto one replication node is adequate to reconstruct a lost node, while in MDS erasure codedsystems which are optimal in terms of redundancy-reliability tradeoff, a single node failure isrepaired after recovering the ...
متن کاملCascading Failures in Interdependent Systems: Impact of Degree Variability and Dependence
We study cascading failures in a system comprising interdependent networks/systems, in which nodes rely on other nodes both in the same system and in other systems to perform their function. The (inter-)dependence among nodes is modeled using a dependence graph, where the degree vector of a node determines the number of other nodes it can potentially cause to fail in each system through aforeme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003